A Parallel Decomposition Method for Nonconvex Stochastic Multi-Agent Optimization Problems
نویسندگان
چکیده
منابع مشابه
A Parallel Stochastic Approximation Method for Nonconvex Multi-Agent Optimization Problems
Consider the problem of minimizing the expected value of a (possibly nonconvex) cost function parameterized by a random (vector) variable, when the expectation cannot be computed accurately (e.g., because the statistics of the random variables are unknown and/or the computational complexity is prohibitive). Classical sample stochastic gradient methods for solving this problem may empirically su...
متن کاملAsynchronous Parallel Stochastic Gradient for Nonconvex Optimization
Asynchronous parallel implementations of stochastic gradient (SG) have been broadly used in solving deep neural network and received many successes in practice recently. However, existing theories cannot explain their convergence and speedup properties, mainly due to the nonconvexity of most deep learning formulations and the asynchronous parallel mechanism. To fill the gaps in theory and provi...
متن کاملA Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization
and Applied Analysis 3 Proof. Since f(x) defined in (2) belongs to the PDGstructured family and by Lemma 2.1 in [16] the Clarke subdifferential of F(x, ρ) at x can be formulated by ∂F (x, ρ) = ∂f (x) + ρ∂G (x) = ∂f (x) + ρ conv { ∇g j (x) | j ∈ J (x) ∪ {0}}
متن کاملA Multi Objective Optimization Model for Redundancy Allocation Problems in Series-Parallel Systems with Repairable Components
The main goal in this paper is to propose an optimization model for determining the structure of a series-parallel system. Regarding the previous studies in series-parallel systems, the main contribution of this study is to expand the redundancy allocation parallel to systems that have repairable components. The considered optimization model has two objectives: maximizing the system mean time t...
متن کاملOn a decomposition method for nonconvex global optimization
A rigorous foundation is presented for the decomposition method in nonconvex global optimization, including parametric optimization, partly convex, partly monotonic, and monotonic/linear optimization. Incidentally, some errors in the recent literature on this subject are pointed out and fixed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2531627